Iterations of Multivariate Polynomials and Discrepancy of Pseudorandom Numbers
نویسندگان
چکیده
In this paper we present an extension of a result in [2] about a discrepancy bound for sequences of s-tuples of successive nonlinear multiple recursive congruential pseudorandom numbers of higher orders. The key of this note is based on linear properties of the iterations of multivariate polynomials.
منابع مشابه
Exponential sums with Dickson polynomials
We give new bounds of exponential sums with sequences of iterations of Dickson polynomials over prime finite fields. This result is motivated by possible applications to polynomial generators of pseudorandom numbers. © 2004 Elsevier Inc. All rights reserved.
متن کاملMultiplicative Character Sums for Nonlinear Recurring Sequences with Dickson Polynomials
We give new bounds of character sums with sequences of iterations of Dickson polynomials over finite fields. This result is motivated by possible applications of nonlinear congruential pseudorandom number generators.
متن کاملOn the degree growth in some polynomial dynamical systems and nonlinear pseudorandom number generators
In this paper we study a class of dynamical systems generated by iterations of multivariate polynomials and estimate the degree growth of these iterations. We use these estimates to bound exponential sums along the orbits of these dynamical systems and show that they admit much stronger estimates than in the general case and thus can be of use for pseudorandom number generation. DOI: https://do...
متن کاملLower Bounds for the Discrepancy of Inversive Congruential Pseudorandom Numbers
The inversive congruential method is a uniform pseudorandom number generator which was introduced recently. For a prime modulus p the discrepancy D of k-tuples of successive pseudorandom numbers generated by this method determines the statistical independence properties of these pseudorandom numbers. It was shown earlier by the author that Dik) = 0(p~l,2(\oëp)k) for2<k<p. Here it is proved that...
متن کاملImproved Lower Bounds for the Discrepancy of Inversive Congruential Pseudorandom Numbers
The inversive congruential method with prime modulus for generating uniform pseudorandom numbers is studied. Lower bounds for the discrepancy of k-tuples of successive pseudorandom numbers are established, which improve earlier results of Niederreiter. Moreover, the present proof is substantially simpler than the earlier one.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001